Stable sets in three agent pillage games∗

نویسندگان

  • Manfred Kerber
  • Colin Rowat
چکیده

We consider pillage games as in Jordan [2006, “Pillage and property”, JET] and show that, for anonymous, three agent pillage games: when the core is non-empty, it must take one of five forms; all such pillage games with an empty core represent the same dominance relation; when a stable set exists, and the game also satisfies a continuity and a responsiveness assumption, it is unique and contains no more than 15 elements, a tight bound. Non-existence is easily determined by applying Zorn’s lemma to the locus of allocations for which the most powerful agent is as powerful as the other two combined. Examples are given both of our core results and cases not covered by them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The University of Birmingham (Live System) Sufficient conditions for unique stable sets in three agent pillage games

Pillage games (Jordan, 2006a) have two features that make them richer than cooperative games in either characteristic or partition function form: they allow power externalities between coalitions; they allow resources to contribute to coalitions’ power as well as to their utility. Extending von Neumann and Morgenstern’s analysis of three agent games in characteristic function form to anonymous ...

متن کامل

Sufficient conditions for unique stable sets in three agent pillage games

Pillage games [Jordan, 2006, “Pillage and property”, JET] have two features that make them richer than cooperative games in either characteristic or partition function form: they allow power externalities between coalitions; they allow resources to contribute to coalitions’ power as well as to their utility. Extending von Neumann and Morgenstern’s analysis of three agent games in characteristic...

متن کامل

Pillage games with multiple stable sets

We prove that pillage games [Jordan, 2006, “Pillage and property”, JET] can have multiple stable sets, constructing pillage games with up to 2 n−1 3 stable sets, when the number of agents, n, exceeds four. We do so by violating the anonymity axiom common to the existing literature, instead endowing some agents to overpower all but a small number of opposing configurations of agents. Thus, when ...

متن کامل

A Ramsey bound on stable sets in Jordan pillage games

Jordan [2006] defined ‘pillage games’, a class of cooperative games whose dominance operator is represented by a ‘power function’ satisfying coalitional and resource monotonicity axioms. In this environment, he proved that stable sets must be finite. We provide a graph theoretical interpretation of the problem which tightens the finite bound to a Ramsey number. We also prove that the Jordan pil...

متن کامل

Using Theorema in the Formalization of Theoretical Economics

Theoretical economics makes use of strict mathematical methods. For instance, games as introduced by von Neumann and Morgenstern allow for formal mathematical proofs for certain axiomatized economical situations. Such proofs can—at least in principle—also be carried through in formal systems such as Theorema. In this paper we describe experiments carried through using the Theorema system to pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009